On the Secret-Key Rate of Binary Random Variables
نویسندگان
چکیده
Consider a scenario in which two parties Alice and Bob as well as an opponent Eve receive the output of a binary symmetric source (e,g. installed in a satellite) over individual, not necessarily independent binary symmetric channels. Alice and Bob share no secret key initially and can only communicate over a public channel completely accessible to Eve. The authors derive a lower bound on the rate at which Alice and Bob can generate secret-key bits about which Eve has arbitrarily little information, This lower bound is strictly positive as long as Eve's binary symmetric channel is not perfect, even if Alice's and Bob's channels are by orders of magnitude less reliable than Eve's channel GANDER, Martin Jakob, MAURER, Ueli M. On the Secret-Key Rate of Binary Random Variables. In: IEEE International Symposium on Information Theory. IEEE, 1994. p. 351 DOI : 10.1109/ISIT.1994.394667
منابع مشابه
The Intrinsic Conditional Mutual Information andPerfect
This paper is concerned with secret key agreement by public discussion: two parties Alice and Bob and an adversary Eve have access to independent realizations of random variables X, Y , and Z, respectively, with joint distribution P XY Z. The secret key rate S(X; Y jjZ) has been deened as the maximal rate at which Alice and Bob can generate a secret key by communication over an insecure, but au...
متن کاملThe Intrinsic Conditional Mutual Information
This paper is concerned with secret key agreement by public discussion: two parties Alice and Bob and an adversary Eve have access to independent realizations of random variables X, Y , and Z, respectively, with joint distribution P XY Z. The secret key rate S(X; Y jjZ) has been deened as the maximal rate at which Alice and Bob can generate a secret key by communication over an insecure, but au...
متن کاملSecret Key Agreement by Public Discussion from Common Information 1 ] Result from N Independent Executions of a Random Experiment Generating
The problem of generating a shared secret key S by two parties knowing dependent random variables X and Y , respectively, but not sharing a secret key initially, is considered. An enemy who knows the random variable Z, jointly distributed with X and Y according to some probability distribution P XY Z , can also receive all messages exchanged by the two parties over a public channel. The goal of...
متن کاملUnconditionally Secure Secret-key Agreement and the Intrinsic Conditional Mutual Information
This paper is concerned with secret-key agreement by public discussion: two parties Alice and Bob and an adversary Eve have access to independent realizations of random variables X, Y , and Z, respectively, with joint distribution P XY Z. The secret key rate S(X; Y jjZ) has been deened as the maximal rate at which Alice and Bob can generate a secret key by communication over an insecure, but au...
متن کاملUnconditionally Secure Key Agreement And The Intrinsic Conditional Information - Information Theory, IEEE Transactions on
This paper is concerned with secret-key agreement by public discussion. Assume that two parties Alice and Bob and an adversary Eve have access to independent realizations of random variables X , Y , and Z, respectively, with joint distribution PXY Z . The secret-key rate S(X;Y kZ) has been defined as the maximal rate at which Alice and Bob can generate a secret key by communication over an inse...
متن کامل